Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013
نویسنده
چکیده
This paper serves as solver description for our SAT solver Lingeling and its two parallel variants Treengeling and Plingeling entering the SAT Competition 2013. We only list important differences to the version of these solvers used in the SAT Challenge 2012. For further information we refer to the solver description [1] of the SAT Challenge 2012 or source code.
منابع مشابه
CADICAL, LINGELING, PLINGELING, TREENGELING and YALSAT Entering the SAT Competition 2017
This paper serves as a first solver description for our new SAT solver CADICAL and documents the versions of our other solvers submitted to the SAT Competition 2017, which are LINGELING, its two parallel variants TREENGELING and PLINGELING, and our local search solver YALSAT. LINGELING,PLINGELING, TREENGELING,YALSAT Our focus in the SAT Competition 2016 was on our new SAT solver SPLATZ [1]. It ...
متن کاملSplatz, Lingeling, Plingeling, Treengeling, Yalsat Entering the Sat Competition 2016
This paper serves as solver description for our new SAT solver Splatz and further documents the versions of our other solvers submitted to the SAT Competition 2016, which are Lingeling, its two parallel variants Treengeling and Plingeling, and our local search solver YalSAT.
متن کاملYet another Local Search Solver and Lingeling and Friends Entering the SAT Competition 2014
This paper serves as solver description for the SAT solvers Lingeling and its two parallel variants Treengeling and Plingeling, as well as for our new local search solver YalSAT entering the Competition 2014. For Lingeling and its variants we only list important differences to earlier version of these solvers as used in the SAT Competition 2013. For further information we refer to the solver de...
متن کاملLingeling and Friends Entering the SAT Race 2015
This is a solver description for our SAT solvers Lingeling, Treengeling and Plingeling entering the SAT Race 2015. We only focus on the difference to their 2014 versions. For further information we refer to previous solver descriptions [1], [2], [3], our POS’14 talk [4] and of course the source code.
متن کاملLingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling
One of the design principles of the state-of-the-art SAT solver Lingeling is to use as compact data structures as possible. These reduce memory usage, increase cache efficiency and thus improve runtime, particularly, when using multiple solver instances on multi-core machines, as in our parallel portfolio solver Plingeling and our cube and conquer solver Treengeling. The scheduler of a dozen in...
متن کامل